Constrained Arc-Eager Dependency Parsing
نویسندگان
چکیده
منابع مشابه
Constrained Arc-Eager Dependency Parsing
Arc-eager dependency parsers process sentences in a single left-to-right pass over the input and have linear time complexity with greedy decoding or beam search. We show how such parsers can be constrained to respect two different types of conditions on the output dependency graph: span constraints, which require certain spans to correspond to subtrees of the graph, and arc constraints, which r...
متن کاملA Dynamic Oracle for Arc-Eager Dependency Parsing
The standard training regime for transition-based dependency parsers makes use of an oracle, which predicts an optimal transition sequence for a sentence and its gold tree. We present an improved oracle for the arc-eager transition system, which provides a set of optimal transitions for every valid parser configuration, including configurations from which the gold tree is not reachable. In such...
متن کاملA Non-Monotonic Arc-Eager Transition System for Dependency Parsing
Previous incremental parsers have used monotonic state transitions. However, transitions can be made to revise previous decisions quite naturally, based on further information. We show that a simple adjustment to the Arc-Eager transition system to relax its monotonicity constraints can improve accuracy, so long as the training data includes examples of mistakes for the nonmonotonic transitions ...
متن کاملArc-Eager Parsing with the Tree Constraint
The arc-eager system for transition-based dependency parsing is widely used in natural language processing despite the fact that it does not guarantee that the output is a well-formed dependency tree. We propose a simple modification to the original system that enforces the tree constraint without requiring any modification to the parser training procedure. Experiments on multiple languages sho...
متن کاملRight-branching Tree Transformation for Eager Dependency Parsing
This paper presents a reversible transformation on dependency trees that produces purely right-branching structures. On their own, these structures are easier for stack-based shift-reduce parsers to learn. We describe experiments training parsers on the transformed trees, parsing raw text, and then reversing the transformation on the results to evaluate. While these conditions do not significan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Linguistics
سال: 2014
ISSN: 0891-2017,1530-9312
DOI: 10.1162/coli_a_00184